Integrating Hierarchical and Analogical Planning
نویسندگان
چکیده
Both hierarchical plmming and analogical phmning (:a~l separately reduce the amount of search a planner must perform to find a solution to a partitular problem. We believe that these two methods cazl bc integrated mtd that the combined planner will have ,-m even smaller average search space them either method would produce ahme. In this work: we present our ideas for integrating the two met hods; focusing on the opportunities for beneficial interactions between analogical plazming and hierarchical plamfing.
منابع مشابه
The Base Selection Task in Analogical Planning
Analogical planning provides a means of solving problems where other machine learning meth ods fail, because it does not require numer ous previous examples or a rich domain the ory. Given a problem in an unfamiliar domain (the target case), an analogical planning sys tem locates a successful plan in a similar do main (the bast case), and uses the similarities to generate the target plan. ...
متن کاملIntegrating Analogical and Sentential Reasoning for Perception
Many diverse sources can contribute to the successful interpretation of sensory input. One fundamental problem for perception is integrating these sources into the interpretation process. We present a hybrid methodology for perception that addresses this integration problem. The approach integrates special-purpose analogical representations used to store partially interpreted sensor data with a...
متن کاملAnalogical Replay for Efficient Conditional Planning
Recently, several planners have been designed that can create conditionally branching plans to solve problems which involve uncertainty. These planners represent an important step in broadening the applicability of AI planning techniques, but they typically must search a larger space than non-branching planners, since they must produce valid plans for each branch considered. In the worst case t...
متن کاملAnalogical Replay for Eecient Conditional Planning
Recently, several planners have been designed that can create conditionally branching plans to solve problems which involve uncertainty. These planners represent an important step in broadening the applicability of AI planning techniques, but they typically must search a larger space than non-branching planners, since they must produce valid plans for each branch considered. In the worst case t...
متن کاملAnalogical Replay for E cient Conditional Planning
Recently, several planners have been designed that can create conditionally branching plans to solve problems which involve uncertainty. These planners represent an important step in broadening the applicability of AI planning techniques, but they typically must search a larger space than non-branching planners, since they must produce valid plans for each branch considered. In the worst case t...
متن کامل